Autore	Knauer U. <1942->
Pubbl/distr/stampa	Berlin ; ; Boston, : De Gruyter, c2011
Descrizione fisica	1 online resource (324 p.)
Disciplina	511/.5
Collana	De Gruyter studies in mathematics
Soggetto topico	Graph theory Algebraic topology
Soggetto genere / forma	Electronic books.
ISBN	1-283-40044-8 9786613400444 3-11-025509-X
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Frontmatter -- Preface -- Contents -- Chapter 1. Directed and undirected graphs -- Chapter 2. Graphs and matrices -- Chapter 3. Categories and functors -- Chapter 4. Binary graph operations -- Chapter 5. Line graph and other unary graph operations -- Chapter 6. Graphs and vector spaces -- Chapter 7. Graphs, groups and monoids -- Chapter 8. The characteristic polynomial of graphs -- Chapter 9. Graphs and monoids -- Chapter 10. Compositions, unretractivities and monoids -- Chapter 11. Cayley graphs of semigroups -- Chapter 12. Vertex transitive Cayley graphs -- Chapter 13. Embeddings of Cayley graphs - genus of semigroups -- Bibliography -- Index -- Index of symbols
Record Nr.	UNINA-9910457590903321

Autore	Golumbic Martin Charles
Pubbl/distr/stampa	New York, New York ; ; London, England : , : Academic Press, , 1980
Descrizione fisica	1 online resource (307 p.)
Disciplina	511/.5
Collana	Computer Science and Applied Mathematics
Soggetto topico	Perfect graphs
ISBN	1-4832-7197-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	Front Cover; Algorithmic Graph Theory and Perfect Graphs; Copyright Page; Dedication; Table of Contents; Foreword; Preface; Acknowledgments; List of Symbols; Chapter 1. Graph Theoretic Foundations ; 1. Basic Definitions and Notations; 2. Intersection Graphs; 3. Interval Graphs-A Sneak Preview of the Notions Coming Up; 4. Summary; Exercises; Bibliography; Chapter 2. The Design of Efficient Algorithms; 1. The Complexity of Computer Algorithms; 2. Data Structures; 3. How to Explore a Graph; 4. Transitive Tournaments and Topological Sorting; Exercises; Bibliography; Chapter 3. Perfect Graphs 1. The Star of the Show2. The Perfect Graph Theorem; 3. p-Critical and Partitionable Graphs; 4. A Polyhedral Characterization of Perfect Graphs; 5. A Polyhedral Characterization of p-Critical Graphs; 6. The Strong Perfect Graph Conjecture; Exercises; Bibliography; Chapter 4. Triangulated Graphs; 1. Introduction; 2. Characterizing Triangulated Graphs; 3. Recognizing Triangulated Graphs by Lexicographic Breadth-First Search; 4. The Complexity of Recognizing Triangulated Graphs; 5. Triangulated Graphs as Intersection Graphs; 6. Triangulated Graphs Are Perfect 7. Fast Algorithms for the COLORING, CLIQUE, STABLE SET, and CLIQUE-COVER Problems on Triangulated GraphsExercises; Bibliography; Chapter 5. Comparability Graphs; 1. Γ-Chains and Implication Classes; 2. Uniquely Partially Orderable Graphs; 3. The Number of Transitive Orientations; 4. Schemes and G-Decompositions-An Algorithm for Assigning Transitive Orientations; 5. The Γ*-Matroid of a Graph; 6. The Complexity of Comparability Graph Recognition; 7. Coloring and Other Problems on Comparability Graphs; 8. The Dimension of Partial Orders; Exercises; Bibliography; Chapter 6. Split Graphs 1. An Introduction to Chapters 6-8: Interval, Permutation, and Split Graphs2. Characterizing Split Graphs; 3. Degree Sequences and Split Graphs; Exercises; Bibliography; Chapter 7. Permutation Graphs; 1. Introduction; 2. Characterizing Permutation Graphs; 3. Permutation Labelings; 4. Applications; 5. Sorting a Permutation Using Queues in Parallel; Exercises; Bibliography; Chapter 8. Interval Graphs; 1. How It All Started; 2. Some Characterizations of Interval Graphs; 3. The Complexity of Consecutive 1's Testing; 4. Applications of Interval Graphs; 5. Preference and Indifference 6. Circular-Arc GraphsExercises; Bibliography; Chapter 9. Superperfect Graphs; 1. Coloring Weighted Graphs; 2. Superperfection; 3. An Infinite Class of Superperfect Noncomparability Graphs; 4. When Does Superperfect Equal Comparability?; 5. Composition of Superperfect Graphs; 6. A Representation Using the Consecutive 1's Property; Exercises; Bibliography; Chapter 10. Threshold Graphs; 1. The Threshold Dimension; 2. Degree Partition of Threshold Graphs; 3. A Characterization Using Permutations; 4. An Application to Synchronizing Parallel Processes; Exercises; Bibliography Chapter 11. Not So Perfect Graphs
Record Nr.	UNINA-9910786640403321

Edizione	[1st ed. 1990.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990
Descrizione fisica	1 online resource (VI, 288 p.)
Disciplina	511/.5
Collana	Lecture Notes in Computer Science
Soggetto topico	Algebra Software engineering Computer science—Mathematics Computers Programming languages (Electronic computers) Software Engineering/Programming and Operating Systems Mathematics of Computing Computation by Abstract Devices Software Engineering Programming Languages, Compilers, Interpreters
ISBN	3-540-47042-5
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	On the power of bounded concurrency II: The pushdown automata level -- Trees everywhere -- Combinatory forms for equational programming: Instances, unification and narrowing -- Graphical versus logical specifications -- More efficient bottom-up tree pattern matching -- On the regular structure of prefix rewriting -- A unified approach for showing language containment and equivalence between various types of ?-automata -- Unitary monoid with two generators: An algorithmic point of view -- Coherence of subsumption -- Petri nets as models of linear logic -- Towards the unification of models for concurrency -- A markovian concurrency measure -- Graph matching in operational semantics and typing -- ML typability is dexptime-complete -- Testing for inductiue (co)-reducibility -- Probabilistic analysis of some distributed algorithms -- Infinite values in hierarchical imperative types -- Equivalence of finite-valued bottom-up finite state tree transducers is decidable.
Record Nr.	UNISA-996465623203316

Edizione	[1st ed. 1992.]
Pubbl/distr/stampa	Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992
Descrizione fisica	1 online resource (IX, 491 p.)
Disciplina	511/.5
Collana	Lecture Notes in Computer Science
Soggetto topico	Computer programming Software engineering Computers Algorithms Computer logic Programming Techniques Software Engineering/Programming and Operating Systems Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs
ISBN	3-540-46799-8
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	A constructive valuation interpretation for classical logic and its use in witness extraction -- Varieties of increasing trees -- Origin functions in ?-calculus and term rewriting systems -- An algebraic approach to the interpretation of recursive types -- Decidability of reachability and disjoint union of term rewriting systems -- A complete type inference algorithm for simple intersection types -- Monadic second-order definable graph transductions -- CTL* and ECTL* as fragments of the modal ?-calculus -- Power domains supporting recursion and failure -- Parallel contraction of fibonacci trees and prefix computations on a family of interconnection topologies -- Must preorder in non-deterministic untyped ?-calculus -- A programming language for deriving hypergraphs -- Graph grammars as context-dependent rewriting systems: A partial ordering semantics -- Empty stack Pushdown ?-tree automata -- Modulo counting quantifiers over finite trees -- Finite tree automata with cost functions -- Partial type assignment in left linear applicative term rewriting systems -- A linear algorithm for solving fixed-point equations on transition systems -- Beyond conditional equations.
Record Nr.	UNISA-996465650003316

Autore	Cherlin Gregory L. <1948->
Pubbl/distr/stampa	Providence, Rhode Island : , : American Mathematical Society, , [1998]
Descrizione fisica	1 online resource (183 p.)
Disciplina	510 s 511/.5
Collana	Memoirs of the American Mathematical Society
Soggetto topico	Directed graphs Tournaments (Graph theory) Model theory Ramsey theory Permutation groups
Soggetto genere / forma	Electronic books.
ISBN	1-4704-0210-6
Formato	Materiale a stampa
Livello bibliografico	Monografia
Lingua di pubblicazione	eng
Nota di contenuto	""Contents""; ""Introduction""; ""Chapter 1. Results and Open Problems""; ""1.1. Homogeneous structures""; ""1.2. A survey of work on homogeneous structures""; ""1.3. Amalgamation classes""; ""1.4. Languages, strong amalgamation, generincation, and Ramsey's theorem""; ""1.5. Classification theorems""; ""1.6. Open problems""; ""Chapter 2. Homogeneous 2-tournaments""; ""2.1. A catalog""; ""2.2. Restricted homogeneous 2-tournaments""; ""2.3. Sources and sinks""; ""2.4. Constrained 2-tournaments""; ""2.5. Unconstrained 2-tournaments""; ""Chapter 3. Homogeneous n-tournaments"" ""3.1. Introduction""""3.2. Hypercritical and small 3-tournaments""; ""3.3. The critical case""; ""3.4. Two embedding lemmas""; ""3.5. Polarized n-tournaments""; ""3.6. Embedding polarized 3-tournaments""; ""3.7. Some special cases""; ""3.8. The general case""; ""Chapter 4. Homogeneous symmetric graphs""; ""4.1. The theorem of Lachlan and Woodrow""; ""4.2. The main ingredients""; ""4.3. Structure of the proof""; ""4.4. Steps 7, 5, 8. Proof of the Main Theorems""; ""4.5. Step 1, Proposition 10: adding K(2)""; ""4.6. Step 1, Proposition 11: the operation H[sup(+)]"" ""7.5. Step 1. Proposition 24: P[sub(3)]""""7.6. Step 1, Proposition 25: adding L(2)""; ""7.7. Step 1, Proposition 26: the operations Â±""; ""7.8. Step 1, Propositions 27 and 28: some 1-types""; ""Chapter 8. Theorems 7.6-7.9""; ""8.1. Step 2. Theorems 7.6 and 7.7""; ""8.2. Step 5. Theorem 7.9.T: extending a direct sum""; ""8.3. Step 3. Theorem 7.8, 1-types over sums""; ""8.4. Theorem 7.8, conclusion""; ""Appendix: Examples for richer languages""; ""Bibliography""; ""Index of Notation""; ""Index""; ""A""; ""B""; ""C""; ""D""; ""E""; ""F""; ""G""; ""H""; ""I""; ""J""; ""K""; ""L""; ""M""; ""N"" ""O""
Record Nr.	UNINA-9910481047303321